A Semantics for ...: A Calculus With Overloading and Late-Binding
نویسنده
چکیده
منابع مشابه
A semantics for λ { } str : a calculus with overloading and late - binding
Up to now there was no interpretation available for λ-calculi featuring overloading and late-binding, although these are two of the main principles of any object-oriented programming language. In this paper we provide a new semantics for a stratified version of Castagna’s λ{}, a λ-calculus combining overloading with late-binding. The model-construction is carried out in EETJ + (Tot) + (F-IN), a...
متن کاملImpredicative Overloading in Explicit Mathematics
We introduce the system OTN of explicit mathematics based on elementary separation, products, joins and weak power types. In this theory, we will define late-bound overloaded functions with a corresponding impredicative type structure à la λ&. Then we present a set-theoretic model for OTN which provides a denotational semantics for impredicative overloading without restricting itself to early-b...
متن کاملA Semantics for a Stratiied &-early: a Calculus with Overloading and Early Binding
The role of ?calculus as core functional language is due to its nature as \pure" theory of functions. In the present approach we use the functional expressiveness of typed-calculus and extend it with our understanding of some relevant features of a broadly used programming style: Object-Oriented Programming (OOP). The core notion we focus on, yields a form of \dependency on input types" (or \on...
متن کاملFunctional Programming Formalisms for OODBMS Methods
Two well-studied functional formalisms in the theory of programming languages are (1) applicative program schemas and (2) typed lambda calculi. We relate these programming formalisms to object-oriented databases (OODBs) and in particular to the description of methods. The language of method schemas (MS) is a programming formalism based on applicative program schemas with additional key object-o...
متن کاملFunctional Programming Formalisms for OODB Methods
Two well-studied functional formalisms in the theory of programming languages are (1) applicative program schemas and (2) typed lambda calculi. We relate these programming formalisms to object-oriented databases (OODBs) and in particular to the description of methods. The language of method schemas (MS) is a programming formalism based on applicative program schemas with additional key object-o...
متن کامل